Generalization of polya’s fundamental theorem in enumerative combinatorial analysis

A combinatorial generalization of Wilson's theorem

Consider all possible oriented Hamiltonian cycles over the vertices of a regular n-gon, where n ∈ N, n ≥ 3. The main aim of this note is to count the cycles which are not equivalent under the rotations of the n-gon. It is well known when n is a prime number the number of simple cycles is |HCn| = n− 2 + (n− 1)! + 1 n , so the above counting problem leads to the classical Wilson’s theorem. We cou...

A GENERALIZATION OF A JACOBSON’S COMMUTATIVITY THEOREM

In this paper we study the structure and the commutativity of a ring R, in which for each x,y ? R, there exist two integers depending on x,y such that [x,y]k equals x n or y n.

A Generalization of ̧ Stokes Theorem on Combinatorial Manifolds ̧

A Combinatorial Analysis of Enumerative Data Structures for Assembly Planning

An assembly planner is a program designed to generate high-level plans for the manufacture of mechanical assemblies. At this time several experimental assembly planning systems have been developed. However each has deened the problem diierently, using diierent deenitions of an assembly plan and applying diierent restrictions to the planning process. This report surveys, analyzes and evaluates s...

analysis of power in the network society

اندیشمندان و صاحب نظران علوم اجتماعی بر این باورند که مرحله تازه ای در تاریخ جوامع بشری اغاز شده است. ویژگیهای این جامعه نو را می توان پدیده هایی از جمله اقتصاد اطلاعاتی جهانی ، هندسه متغیر شبکه ای، فرهنگ مجاز واقعی ، توسعه حیرت انگیز فناوری های دیجیتال، خدمات پیوسته و نیز فشردگی زمان و مکان برشمرد. از سوی دیگر قدرت به عنوان موضوع اصلی علم سیاست جایگاه مهمی در روابط انسانی دارد، قدرت و بازتولید...